Fibered universal algebra for first-order logics
نویسندگان
چکیده
We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing “algebraic” semantics nonclassical first-order logics. This includes natural notion of substitution, which allows logics be considered as structural closure operators just propositional are in abstract algebraic logic. then establish an extension the homomorphism theorem from universal algebra generalized and characterize two on prop-categorical semantics. The first closes class structures (which interpreted morphisms prop-categories) under satisfaction their common theory second associated consequence. It turns out, these have characterizations that closely mirror Birkhoff's characterization algebras equational Blok Jónsson's consequence, respectively. These unique They do not analogs, example, Tarskian classical we consider much more than traditional intuitionistic or triposes (i.e., topos representing indexed partially ordered sets). Nonetheless, our knowledge, results still new, even when restricted special classes prop-categories.
منابع مشابه
Universal Algebra for Logics
These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic in Montreux. They cannot be recommended for self studies because, although all definitions and main ideas are included, there are no proofs and examples. I’m going to provide some of them during my lectures, leaving easy ones as exercises. In the first part we discuss some of the most important n...
متن کاملFirst-order Gödel logics
First-order Gödel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics GV (sets of those formulas which evaluate to 1 in every interpretation into V ). It is shown that GV is axiomatizable iff V is finite, V is uncountable with 0 isolated in V , or eve...
متن کاملFree Order Sorted Universal Algebra
In this paper S is an order sorted signature. Let S be an order sorted signature and let U0 be an order sorted algebra of S. A subset of U0 is called an order sorted generator set of U0 if: (Def. 1) For every OSSubset O of U0 such that O = OSCl it holds the sorts of OSGenO = the sorts of U0. The following proposition is true (1) Let S be an order sorted signature, U0 be a strict non-empty order...
متن کاملSome connections between universal algebra and logics for trees
One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this problem and similar ones using the language of universal algebra, highlighting potential connections to the structural theory of finite algebras, including Tame...
متن کاملCombining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings
We present a general approach for integrating certain mathematical structures in rst-order equational theorem provers. More specifically , we consider theorem proving problems speciied by sets of rst-order clauses that contain the axioms of a commutative ring with a unit element. Associative-commutative superposition forms the deduc-tive core of our method, while a convergent rewrite system for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2024
ISSN: ['1873-1376', '0022-4049']
DOI: https://doi.org/10.1016/j.jpaa.2023.107415